Towards Granular Computing: Classifiers Induced From Granular Structures

نویسندگان

  • Lech Polkowski
  • Piotr Artiemjew
چکیده

Granular computing as a paradigm is an area frequently studied within the Approximate Reasoning paradigm. Proposed by L. A.Zadeh granular computing has been studied within fuzzy as well as rough set approaches to uncertainty. It is manifest that both theories are immanently related to granulation as fuzzy set theory begins with fuzzy membership functions whose inverse images are prototype granules whereas rough set theory starts with indiscernibility relations whose classes are prototype, or, elementary granules. Many authors have devoted their works to analysis of granulation of knowledge, definitions of granules, methods for combining (fusing) granules into larger objects, applications of granular structures, see, quoted in references works by A. Skowron, T.Y. Lin, Y.Y.Yao, L.Polkowski and others. In this work, the emphasis is laid on granular decision (data) systems: they are introduced, methods of their construction with examples are pointed to, and applications are exhibited; those applications are founded on the basic although often implicit principle of data mining, viz., once a plausible for given data similarity measure is found, objects satisfactorily similar should reveal sufficiently close (or, for that matter identical) class values. In this work, this principle is applied to granules, following the idea presented by L.Polkowski at 2005, 2006 IEEE GrC conferences, that granules built on basis of a similarity relation from a given decision system should consists of objects similar to such a degree that averaging them would lead to new objects which together would constitute a new decision system preserving to a high degree knowledge represented by the original decision system. As knowledge in rough set theory is meant as the classification ability, it seems reasonable to test knowledge content with classifiers as classifier accuracy. This informal idea is tested in this work with some specific tools for granule construction, granular system building, and some well–tested classifiers known in literature for a few data sets from the UCI repository. In the following sections we outline: basic ideas of rough computing, granulation of knowledge, the idea of a granular decision system and we include the results of exemplary tests with real data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS

Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...

متن کامل

On the Idea of Using Granular Rough Mereological Structures in Classification of Data

This paper is devoted to an exposition of the idea of using granular structures obtained from data in the classification tasks of these data into decision classes. Classifiers are induced from granular reflections of data sets.

متن کامل

On Granular Rough Computing: Factoring Classifiers Through Granulated Decision Systems

The paradigm of Granular Computing has quite recently emerged as an area of research on its own; in particular, t is pursued within rough set theory initiated by ZdzisÃlaw Pawlak. Granules of knowledge consist of entities with a similar in a sense information content. An idea of a granular counterpart to a decision/information system has been put forth, along with its consequence in the form of...

متن کامل

Uncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space

Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...

متن کامل

Granular Decision Tree and Evolutionary Neural SVM for Protein Secondary Structure Prediction

A new sliding window scheme is introduced with multiple windows to form the protein data for SVM. Two new tertiary classifiers are introduced; one of them makes use of support vector machines as neurons in neural network architecture and the other tertiary classifier is a granular decision tree based on granular computing, decision tree and SVM. Binary classifier using multiple windows is compa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007